Efficient transformation capabilities of single database private block retrieval

نویسندگان

چکیده

Abstract Private information retrieval (PIR) is one of the promising techniques to preserve user privacy in presence trusted-but-curious servers. The theoretically private query construction assures highest over curious and unbounded computation Therefore, need for information-theoretic was fulfilled by various schemes a variety PIR settings. But, there lack efficient encryption switching scheme which supports between to/from computationally bounded PIRs. We propose combination new bit connection methods called rail-shape signal-shape quadratic residuosity assumption based family trapdoor functions generic single database block (PBR). main goal this work show that possibility mapping from theoretic or vice-versa setting using newly constructed function combinations. Notably, proposed are round, memoryless plain (at their basic constructions).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Database Private Information Retrieval with Logarithmic Communication

In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously the best result could only achieve polylogarithmic communication, and was based on certain less well-studied assumptions in number theory [CMS99]. On the contrary, our construction is based on Paillier’s cryptosystem [P9...

متن کامل

Single - Database Private Information Retrieval Protocols : Overview , Usability and Trends

A Private Information Retrieval (PIR) scheme is a protocol in which a user retrieves a record out of N from a replicated database, while hiding from the database which record has been retrieved, as long as the different replicas do not collude. A specially interesting sub-field of research, called singledatabase PIR, deals with the schemes that allow a user to retrieve privately an element of a...

متن کامل

Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval

We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More speciically, based on the quadratic resid-uosity assumption, we present a single database, computationally-private information-retrieval scheme with O(n) communication complexity for any > 0.

متن کامل

Single Database Private Information Retrieval Implies Oblivious Transfer

A Single-Database Private Information Retrieval (PIR) is a protocol that allows a user to privately retrieve from a database an entry with as small as possible communication complexity. We call a PIR protocol non-trivial if its total communication is strictly less than the size of the database. Non-trivial PIR is an important cryptographic primitive with many applications. Thus, understanding w...

متن کامل

Single-Database Private Information Retrieval with Constant Communication Rate

We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ logn is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block. This communication complexity is better asymptotically than previous single-database PIR schemes. The scheme also gives improved performance for practical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Information Technology

سال: 2022

ISSN: ['2511-2112', '2511-2104']

DOI: https://doi.org/10.1007/s41870-021-00848-y